Top 40 cache algorithm compared to LRU and LFU

نویسنده

  • A. van Hoof
چکیده

Describing the workings of a specially written caching algorithm unofficially called Top40 and comparing it to two more common algorithms LRU (Least Recently Used) and LFU (Least Frequently Used) this report tries to show the effectiveness of Top40 algorithm in a media streaming environment. Simulations where done using real data. These simulations show the effectiveness of the Top40 algorithm and its main advantage in the current environment with big media-file sizes: almost no inserts. Preface This report was created as part of a four week research project done as part of the Systemand Network-engineering master at the University of Amsterdam. The research was mostly done on the NPO-ICT (Nederlandse Publieke Omroep ICT) location at Mediapark Hilversum. I would like to thank the department NPO-ICT for providing resources and time for this research project. A special thanks to Dick Snippe whose guidance and clear explanations gave me the insights needed to do this project.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least recently plus five least frequently replacement policy (LR+5LF)

In this paper, we present a new block replacement policy in which we proposed a new efficient algorithm for combining two important policies Least Recently Used (LRU) and Least Frequently Used (LFU). The implementation of the proposed policy is simple. It requires limited calculations to determine the victim block. We proposed our models to implement LRU and LFU policies. The new policy gives e...

متن کامل

Neuro-fuzzy system in partitioned client-side Web cache

This paper proposes a novel contribution in Web caching area, especially in Web cache replacement, so-called intelligent client-side Web caching scheme (ICWCS). This approach is developed by splitting the client-side cache into two caches: short-term cache that receives the Web objects from the Internet directly, and long-term cache that receives the Web objects from the short-term cache. The o...

متن کامل

A Replacement Algorithm Based on Weighting and Ranking Cache Objects

Caching is one of the major steps in system designing to reach a higher performance in operating systems, databases and World Wide Web. High performance processors need memory systems with a proper access time, but still there is a big gap between performances of processors and memory systems. Virtual memory management and hierarchical memory models play an important role in system performance....

متن کامل

The persistent-access-caching algorithm

Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching systems is designing document placement/replacement algorithms for updating the collection of cached documents. Themain design objectives of such a policy are the high cache hit ratio, ease of implementation, low complexity and adap...

متن کامل

Cross-Layer System for Cluster Based Data Access in MANET’S

The objective of cooperative caching is to improve data availability, improve access efficiency and reduce query delay in mobile Ad-Hoc networks. Many types of cache replacement algorithms like LRU, LFU, LFRU, LRU-MIN and LFU-MIN are used to improve data accessibility and reduce query delay in cluster based cooperative caching in Mobile Ad-Hoc networks. But they have some limitations such as ac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009